Method and apparatus for scheduling packets and/or cells

ABSTRACT

A system and method of switching data using a switch device that includes a plurality of input ports, a plurality of switch units, and a plurality of output ports. Each input port storing data to be sent may generate a request to output data to each of the output ports to which stored data is to be sent, wherein each request identifies a specific one of the plurality of switch units to be used to transfer the data from the corresponding input port to the corresponding output port. Grants may be generated per output port per switch unit. Grants may be accepted per input port per switch unit. Data may be outputted from the respective input ports to the respective output ports, based on the accepted grants, utilizing the switch units identified in the requests corresponding to the accepted grants.

RELATED APPLICATION INFORMATION

The present application is continuation of U.S. application Ser. No.12/178,839, filed Jul. 24, 2008, which is a continuation of U.S.application Ser. No. 11/029,624, filed Jan. 6, 2005, now U.S. Pat. No.7,408,947 B2, the entire contents of which are incorporated herein byreference.

NOTICE OF COPYRIGHTS AND TRADE DRESS

A portion of the disclosure of this patent document contains materialwhich is subject to copyright protection. This patent document may showand/or describe matter which is or may become trade dress of the owner.The copyright and trade dress owner has no objection to the facsimilereproduction by anyone of the patent disclosure as it appears in thePatent and Trademark Office patent files or records, but otherwisereserves all copyright and trade dress rights whatsoever.

BACKGROUND

1. Field

The invention relates generally to scheduling of packets and/or cells inan input buffered switch, and, more particularly, to a packet and cellswitching apparatus method using parallel switching units. Switchingperformance is improved by increasing the number of scheduled packetsand/or cells per time period in a switching system using parallelswitching units.

2. Description of the Related Art

With respect to the design of large-scale packet switches and routers,it is well known in the art that a pure output buffering strategy, whileproviding high switching efficiency, is not scalable as switchdimensions get larger. This is mainly due to the requirement that theswitch core operates faster than the individual switch ports by a factorequivalent to the number of ports. For this reason, large capacityswitches are generally of the “input buffered” variety, with the inputand output port modules being interconnected via switch units such ascrossbars. To overcome the input buffer head-of-line (HOL) blockingphenomenon, the buffer at each input port is organized into a set ofinput queues, and each input queue is dedicated for packets destined toa particular output port.

A general input queued switch has N input ports and M output ports,whereby N and M are integer values, in which each input port uses aninput queue per output port, and whereby there are therefore N×M inputqueues in total. A scheduler identifies a set of matching input/outputpairs between which packets or cells are transmitted via switch unitswithout conflict. The throughput efficiency of this switch depends onthe efficiency of the scheduling algorithm. For this reason, a varietyof scheduling algorithms based on various forms of sub-optimalheuristics are currently employed in the industry.

Three widely known heuristic algorithms for scheduling traffic ininput-queued switches are: Parallel Iterative Matching (PIM),Round-Robin Matching (RRM) and iSLIP. Each of these algorithms tries tomaximize the matching efficiency by attempting to pick conflict freesets of inputs/output pairs, and, typically, multiple successiveiterations are performed to improve the matching efficiency.

The PIM method consists of three steps: request, grant, and accept. Atthe request step, N×M input queues send requests to output ports. At thegrant step, each output port randomly grants a request among receivedrequests and notifies the result to each input port. An input port mayreceive a number of grants from output ports, but accepts only onerandomly selected grant. Thus, the PIM method operates by randomlyselecting a candidate input for each output port in a first outputarbitration (grant step) phase. Then, in a second input arbitration(accept step) phase, the system resolves conflicts among the pluralityof outputs that may be selected for each input, by employing a similarrandomization strategy.

The RRM method achieves the same goals in a similar sequence of outputand input arbitration phases as with the PIM method, except that theselections are made in a deterministic fashion using a round-robinarbitration pointer implemented at each output and input port.

The iSLIP method operates in a way similar to RRM, except that themovement of the output and input round-robin pointers is conditioned onsuccessful matches, whereas it is unconditional in the case of RRM. Thetypical iSLIP method is described in detail in U.S. Pat. No. 5,500,858,issued to Nicholas McKeown.

In conventional switch devices, resource arbitration must be addressed.One such conventional resource arbitration method is described in detailin U.S. Pat. No. 5,267,235, issued to Charles Thacker, whereby a rapidone-to-one match between requesters and servers is performed, wherebyeach server selects one request, preferably in a random manner.

Another scheduling algorithm is described in U.S. Pat. No. 6,633,568,issued to Man Soo Han et al., whereby a two-dimensional round-robinscheduling algorithm is described, in which multiple selections are madein an input-buffered switch.

Yet another scheduling algorithm is described in U.S. Pat. No.6,813,274, issued to Hiroshi Suzuki et al., which attempts to solve aproblem with conventional scheduling method of only allowing one acceptper input port, by allowing for multiple accepts per inputs.

For each of these conventional scheduling algorithms, a synchronizationproblem exists when a number of output ports generate a grant for anidentical input port. These algorithms attempt to maximize the matchingefficiency by performing multiple successive iterations, and in theworst case, the algorithm must be repeated N times to converge for anN.times.M switch. Furthermore, these multiple iterations decrease theswitching performance in terms of scheduling decisions per time unit.

The present invention is directed to overcoming or at least reducing theeffects of one or more of the problems set forth above.

SUMMARY OF THE INVENTION

According to at least one aspect of the invention, there is provided amethod of scheduling data in a switch that includes a plurality of inputports each having at least one input queue, a plurality of switch units,and a plurality of output ports. The method includes: a) generating perinput port a request to output data, to each of the output ports towhich data is waiting at the input port to be sent to the output port,wherein the request identifies one of the plurality of switch units tobe used in transferring data from the corresponding input port to thecorresponding output port, the identified one of the plurality of switchunits being identified according to a first priority scheme. The methodalso includes: b) granting access, per output port, per switch unitidentified, to the requests made in step a), the granting being based ona second priority scheme. The method further includes: c) acceptinggrants per input port, per switch unit, the accepting being based on athird priority scheme. The method still further includes: d) outputtingdata from the respective input ports to the respective output ports,based on the accepted grants, utilizing the corresponding switch unitsidentified in the accepted grants.

According to another aspect of the invention, there is provided a systemfor scheduling data. The system includes a switch that includes aplurality of input ports each having at least one input queue. Theswitch also includes a plurality of switch units that arecommunicatively connected to the plurality of input ports. The switchfurther includes a plurality of output ports that are communicativelyconnected to the plurality of switch units. The switch also includes ascheduler that is configured to: a) per input, generate a request tooutput data stored in an input queue of each of the input ports, to eachof the output ports to which data is to be sent, wherein the requestincludes identifying which of the plurality of switch units are to beused in a transfer of data from the corresponding input ports to thecorresponding output ports, the identified ones of the plurality ofswitch units being identified according to a first priority scheme; b)grant access, per output port, per switch unit identified, to thegenerated request, the granting being based on a second priority scheme;c) accept a grant per input port, per switch unit, the accepting beingbased on a third priority scheme; and d) instruct the correspondinginput port to output data from the corresponding input queue of thecorresponding ones of the input ports to the corresponding ones of theoutput ports, based on the accepted grant, by utilising thecorresponding switch units identified in the accepted grant.

According to yet another aspect of the invention, there is provided amethod of scheduling packets or cells for a switch that includes aplurality of input ports each having at least one input queue, aplurality of switch units, and a plurality of output ports. The methodincludes: a) generating per input port a request to output data, to eachof the output ports to which data is waiting at the input port to besent to the output port, wherein the request includes identifying one ofthe plurality of switch units to be used in a transfer of the packet orcell from the corresponding input port to the corresponding output port,the identified one of the plurality of switch units being identifiedaccording to a first priority scheme. The method also includes: b)granting access, per output port per at least one of said switch units,to the requests made in step a), the granting being based on a secondpriority scheme. The method further includes: c) accepting grants perinput port per at least one of said switch units, the accepting beingbased on a third priority scheme. The method still further includes: d)outputting packets and/or cells from the respective input ports to therespective output ports, based on the accepted grants, utilizing thecorresponding switch units identified in the accepted grants.

According to another aspect of the invention, there is provided a systemfor scheduling packets or cells. The system includes a switch thatincludes a plurality of input ports each having at least one inputqueue. The switch also includes a plurality of switch units that arecommunicatively connected to the plurality of input ports. The switchfurther includes a plurality of output ports that are communicativelyconnected to the plurality of switch units. The switch system stillfurther includes a scheduler that is configured to: a) receive a requestgenerated by at least one of the input units, the request being made tooutput data stored in an input queue of the input ports, to each of theoutput ports to which data is to be sent, wherein the request includesidentifying which of the plurality of switch units are to be used in atransfer of the packet or cell from the corresponding input ports to thecorresponding output ports, the identified ones of the plurality ofswitch units being identified according to a first priority scheme; b)grant access, per output port per at least one of said switch units, tothe requests made in step a), the granting being based on a secondpriority scheme; c) accept grants per input port per at least one ofsaid switch units, the accepting being based on a third priority scheme;and d) output packets and/or cells from the respective input ports tothe respective output ports, based on the accepted grants, utilizing thecorresponding switch units identified in the accepted grants.

DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a switching system according to a first embodiment of theinvention.

FIG. 2 shows steps involved in a scheduling method according to anembodiment of the invention.

FIG. 3 shows a block diagram of a scheduling device according to anembodiment of the invention.

FIG. 4 shows four iterations of processing performed by a schedulingdevice according to an embodiment of the invention.

FIG. 5 shows four iterations of processing performed by a schedulingdevice according to another embodiment of the invention.

FIG. 6 shows steps involved in a scheduling method according to anotherembodiment of the invention.

DETAILED DESCRIPTION

The present embodiments are directed to switching systems and methodshaving parallel switching units, whereby switching performance isimproved by allowing each output port to generate multiple grants perscheduler iteration, and by allowing each input port to accept multiplegrants per scheduler iteration. This is different from conventionalscheduling algorithms such as iSLIP, PIM and RRM, which only allow forthe generation and acceptance of a single grant per scheduler iterationper output and input port, respectively.

Compared to the conventional scheduling algorithms, a method andapparatus according to at least one embodiment of the invention changesthe request step to specify per request which one of the multipleparallel switch units is requested; it changes the grant step to allowfor the generation of up to one grant for each of the parallel switchunits per output port, and it changes the accept step to allow for theacceptance of up to one grant for each of the parallel switch units perinput port. This means that each input and output port can switchmultiple packets or cells per scheduler iteration, which increases thenumber of packet or cell scheduling decisions per time unit. Thisconsequently increases the schedulers matching efficiency and theswitching capacity of a switching system using parallel switch units.

Furthermore, a method and apparatus according to at least one embodimentof the invention allows for a reduction of packet and cell tax switchinginefficiencies, since the time period per switching decisions isreduced. Still further, a method and apparatus according to at least oneembodiment of the invention provides for the capability of switchingboth variable size packet and fixed-size cells without resorting topacket fragmentation and reassembly.

FIG. 1 shows an N.times.M port switching apparatus (N and M are integervalues) incorporating a scheduling method and apparatus according to atleast one embodiment of the present invention. Each of the N input ports100 receives packet and/or cells and buffers them in input queues 180according to their output port destination, which is one of the M outputports 150 respectively connected to the M output units 140 by way ofoutput links 150. Each input unit 110 and output unit 140 connects to anumber (K) of parallel switch units 120.

The input units 110 connect to the switch units 120 via input links 160,and the output units 140 connect to the switch units 120 via outputlinks 170. Input unit #1 connects to input #1 on each of the K parallelswitch units 120, input unit #2 connects to input #2 on each of the Kparallel switch units 120, . . . , and input unit #N connects to input#N on each of the K parallel switch units 120. Similarly, output unit #1connects to output #1 on each of the K parallel switch units 120, outputunit #2 connects to output #2 on each of the K parallel switch units120, . . . , and output unit #N connects to output #N on each of the Kparallel switch units 120. The switch units are functionally distinctfrom one another by functioning in parallel to one another as describedbelow. Exemplary ways to actually set up the scheduler units aredescribed below.

The scheduling method of an embodiment of the present invention ispreferably incorporated into a scheduler unit, and the scheduler unitmay by implemented in any of the input units 110, the output units 140or the switch units 120. Alternatively, the scheduler unit may beincorporated into a separate unit not specifically shown in FIG. 1. Inone possible implementation, the scheduler unit is incorporated into oneof the switch units 120 or as a separate unit. The scheduler unitperforms the scheduling of the packets and/or cells from the inputqueues 180, across the switch units 120, for switching to an output unit140, before final forwarding to their destination output port 150.

FIG. 2 is a flowchart showing steps performed by a scheduling methodaccording to a first embodiment of the invention. The first step 200 isto continuously load the packets and/or cells arriving at the inputports into input queues from which requests for specific output portscan be generated. The next step 210 is to request access to the specificoutput port for each packet or cell existing at the front of each inputqueue. The next step 220 is to grant output ports to the requests. Thenext step 230 is for the input ports to accept grants from the outputports. The next step 240 is to generate input-to-output switch linkallocation decisions and transmit the packets/cells to their destinationoutput port via the switch units. The process is then repeated, wherebyit returns back to step 210 to schedule another cell or packet.

Each of the three steps is performed in the first embodiment once perscheduler iteration, whereby each step is described in detail below.

Step 1 (request step): Each input port generates a request to all outputports for which it has data waiting in an input queue. Each request froman input to output port specifies a specific switch unit, and each inputport uses a rotating priority scheme per output port to select which oneof the parallel switch units to request for the output port.

The rotating priority scheme selects the switch unit with the highestpriority. Thereafter, the designation of the highest priority isincremented, causing the highest priority element of the last iterationto become the lowest priority element in the following iteration.Preferably, the increment step is only executed if the request resultedin a grant generation in step 2 which was consequently accepted in step3, since this produces a desirable de-synchronization effect between theswitch unit selection decisions performed by the scheduler.

A difference between the request step performed in the first embodimentand the request step in the conventional PIM, iSLIP or RRM methods isthat, for these conventional methods, all requests generated by anyinput port are always for the same and single switch unit, while in themethod according to the first embodiment, the request is for one of anumber of parallel switch units. Also, in the first embodiment, arotating priority scheme is used to identify which one of the parallelswitch units is requested per request per output port. The rotatingpriority scheme utilized in the first embodiment may be a round robinpriority scheme, or some other type of priority scheme that keeps trackof assignments made between input units, switch units and output unitsin previous scheduling iterations. For example, a random priority schemeis explained in a later section, with respect to a different embodimentof the invention.

Step 2 (grant step): After the request step, access is granted peroutput port per switch unit. A rotating priority scheme is used peroutput port per switch unit to select a request from an input port,similar to the rotating priority scheme previously described withrespect to the request step (step 1). A rotating priority scheme onlyconsiders requests which were made specifically for the correspondingswitch unit. Preferably, the increment step is only executed if thegrant is correspondingly accepted in step 3, since this produces adesirable de-synchronization effect between the grant selectiondecisions performed by the scheduler.

All of the generated grants from a particular output port are fordifferent input ports, since each input port can only request a singleswitch unit per output port.

A difference between the grant step performed in the first embodiment,as compared to the grant step in the conventional PIM, iSLIP or RRMmethods is that, in these conventional methods, each output port onlygrants access for a single input port, while in the method according tothe first embodiment each output port can grant access for an input portfor each of the parallel switch units. In other words, according to atleast one embodiment of the invention, an output port can effectivelygrant access to multiple input ports through the use of parallel switchunits.

Step 3 (accept step): After the grant step, the next step is to acceptgrants per input port per switch unit. A rotating priority scheme isused per input port per switch unit to select a grant from an outputport, similar to the rotating priority scheme previously described. Arotating priority scheme only considers grants made specifically for thecorresponding switch unit. After the accept decision, the priority isincremented by one value beyond the accepted priority element.

Note that all of the accept decisions made for a particular input portare for different output ports, since each output port can only grant asingle switch unit per input port.

A difference between the accept step of the first embodiment, ascompared to the accept step in the conventional PIM, iSLIP or RRMmethods is that, in these conventional methods, each input port onlyaccepts a single grant from an output port, while in the methodaccording to the first embodiment each input port can accept a grantfrom an output port for each of the parallel switch units. In otherwords, according to at least one embodiment of the invention, an inputport can effectively accept grants from multiple output ports throughthe use of parallel switch units.

After step 3, the final processing is to allocate the correspondinginput and output switch unit links according to the accepted grants instep 3, and transmit the corresponding packets and/or cells to theirdestination output ports via their corresponding allocated switch units.

If the switching apparatus only implements a single switch unit, i.e.,there are no parallel switch units, the operation of the methodaccording to the first embodiment becomes analogous to the operation ofthe iSLIP scheduler algorithm, except that in one possibleimplementation of the first embodiment, the scheduler can be used toswitch variable size packets without resorting to packetfragmentation/reassembly, unlike iSLIP which is only applicable to theswitching of cells (fixed-size packets). Application of an embodiment ofthe invention to switch both variable size packets and fixed-size cellsis found below.

The following examples further illustrate the operation of the variousembodiments of the present invention.

FIG. 4 illustrates four iterations of the scheduling method of FIG. 2,performed for a switching system with two input ports, two output ports,and where two parallel switch units labeled a and b connect the inputports to the output ports. This example system corresponds to a systemwhere N=2, M=2 and K=2 as defined by FIG. 1. Also shown in FIG. 4 arethe request pointers 410, the requests 420, the grant pointers 430, thegrants 440, the accept pointers 450, and the accepts 460.

FIG. 4 illustrates, per iteration, a request step corresponding to step210 in FIG. 2, a grant step corresponding to 220 in FIG. 2, and anaccept step corresponding to 230 in FIG. 2. At the beginning of each ofthe four iterations, each input unit 110 has data waiting in an inputqueue 180 for every output unit 140 (and thus, for every output port) inthe system.

The request generation for the scheduling method shown in FIG. 4 isperformed using a two value rotating priority scheme per (input, output)port combination to select which of the switch units a and b shall berequested. The grant generation is performed using a two value rotatingpriority scheme per output port on switch units (a, b) to select arequest from input port 1 or 2. The accept generation is performed usinga two value rotating priority scheme per input port on switch units (a,b) to select a grant from output port 1 or 2.

The processing during iteration 1 begins with each input requestingaccess to outputs 1 and 2, and the rotating priority scheme determinesfor each request whether the request is made for switch unit a or b, asdetermined by the value of the request pointers 410. Input 1 requestsoutput 1 via switch unit a, and output 2 via switch unit a. Input 2requests output 1 via switch unit a, and output 2 via switch unit a. Therequest pointers 410 are all pointed to switch a in iteration 1.

After the request step follows the grant step, where each output onswitch units a, b selects a request from an input port, and the rotatingpriority scheme determines for each output on switch units a and b,whether the grant is made for input 1 or 2, as determined by the valueof the grant pointers 430. Output 2 grants to input 1 via switch unit a,and output 1 grants to input 1 via switch unit a.

After the grant step follows the accept step, where each input on switchunits a, b selects a grant from an output port, and the rotatingpriority scheme determines for each input on switch units a and b,whether the accept is made for output 1 or 2, as determined by the valueof the accept pointers 450. Input 1 accepts a grant from output 1 viaswitch unit a, and the corresponding cell or packet is then transmittedto its destination output port via switch unit a.

The processing now continues to iteration 2. Due to the processingresult in iteration 1, the request pointer for (input 1, output 1) hasnow been incremented from switch unit a to b, while the other requestpointers which did not result in an accept in step 3 (step 230 in FIG.2) remain at the same value as at the beginning of iteration 1. Thegrant pointer for output 1 on switch unit a has been incremented frominput 1 to input 2, while the other grant pointers which did not resultin an accept in step 3 (step 230 in FIG. 2) remain at the same value asat the beginning of iteration 1. The accept pointer for input 1 onswitch unit a has been incremented from output 1 to output 2, while theother accept pointers which did not result in an accept in step 3 (step230 in FIG. 2) remain at the same value as at the beginning of iteration1.

The request step for iteration 2 is the same as for iteration 1, exceptthat input 1 requests output 1 via switch unit b, because of the requestpointer update performed in iteration 1. In the grant step, grants aremade both to input 1 and input 2, and input 1 receives grants via bothswitch units a and b, because of the update of the request and grantpointers in iteration 1, and all of the grants are accepted in theaccept step again due to the pointer updates that occurred in iteration1.

FIG. 5 shows a sub-optimal scheduling method according to a secondembodiment of the invention, to show the advantage of de-synchronizationof the request pointers. In FIG. 5, the request pointers are alwaysautomatically updated per iteration, while in FIG. 4 the requestpointers are only updated if the corresponding request was acceptedwithin the same iteration. By comparing FIG. 4 and FIG. 5, it can beseen that the de-synchronization of the request pointers leads to ahigher matching efficiency per iteration, a desirable feature of thefirst embodiment.

It can be observed that, in the method according to the firstembodiment, an input will continue to request an output port via aspecific switch unit, until the request is finally granted, whichresults in a desirable de-synchronization effect with respect to whichof the parallel switch units are selected by different inputs portrequesting the same output port. The more evenly the distribution of theparallel switch units for the corresponding generated requests, thebetter the matching efficiency per iteration, since a larger number ofthe parallel switch units can be matched per scheduler iteration.

The overall methodology of the invention according to the firstembodiment has been described in detail hereinabove. The followingdiscussion describes different options and approaches for implementingthe embodiments of the invention.

FIG. 3 is a block diagram illustrating one possible embodiment of ascheduler unit according to a third embodiment of the present invention.In one possible implementation, each of the blocks shown in FIG. 3 isimplemented in software; alternatively, some of the features performedby the blocks may be performed by hardware, such as by schematic designor by a hardware description language (HDL) and implemented in aprogrammable logic device (e.g., field programmable gate array/CPLD oran application specific integrated circuit. The scheduler according tothe third embodiment may be configured to perform the methods accordingto any of the embodiments described hereinabove or hereinbelow. Thequeue status 310 per input queue per input 300 is forwarded to a requestblock 320, which is implemented per input port in the system shown inFIG. 1. Each request block 320 is connected to a grant block 340, whichis implemented per output port in the system shown in FIG. 1. Eachconnection from a request block 330 to a grant block 340 can carry asingle request 330 for one of the parallel switch units, and a requestblock 320 may generate up to a total of one request for each grant block340 per scheduler iteration.

Each grant block 340 is connected to an accept block 360 which isimplemented per input port in the system shown in FIG. 1. Eachconnection from a grant block to an accept block can carry a singlegrant 350 for one of the parallel switch units, and a grant block 340may generate up to a total of one grant for each parallel switch unitper scheduler iteration. Each accept block 360 is connected to aacknowledge block 380, which is implemented per input port in the systemshown in FIG. 1. Each connection from an accept block to an acknowledgeblock can carry up to one accept 370 for each of the parallel switchunits in the system shown in FIG. 1, and an accept block 360 maygenerate up to a total of one accept for each parallel switch unit perscheduler iteration.

The acknowledge block 380 performs the processing of step 240 shown inFIG. 2, which controls the transmission of the corresponding packets andcells from the input queues to their corresponding destination outputports via the allocated switch units by generation of acknowledgecommands which are passed back to the input queues to initiate thetransmission of the head-of-line (HOL) packet or cell elements from thecorresponding input queues. The acknowledge blocks are also connected toa switch unit availability block 396, which maintains the allocationstatus of all switch unit input and output links (160 and 170 in FIG.1). After allocation of input and output links, the availability statusfor the allocated input and output links are updated according to thelength of the individual packets or cells. In the preferred embodiment,the size of the packets and cells is not used by step 1, 2 or 3, butonly by the switch unit availability block 396.

If the cells and packets have variable size, the switch unit allocationblock 396 in FIG. 3 maintains input and output link status perindividual link in the system as a function of the length of eachtransmitted individual packet or cell, as is done in a third embodimentof the invention. In the request step for the third embodiment, onlyswitch units for which a corresponding input link-to-output link isavailable are considered by the rotating priority scheme selection of aswitch unit. Otherwise, all of the other steps are the same as the firstembodiment described previously.

Alternatively, if the packets and cells all have the same size (i.e.fixed size packets/cells), the switch unit availability block 396 inFIG. 3 is not required. In such a case, all input and output links aresimply considered available at the beginning of request step 1, and theperiod of time it takes to generate a set of allocation decisions isaligned as close as possible to the transmission period of a fixed-sizecell/packet unit on an input or output link.

The scheduler shown in FIG. 3 has some general similarities to aconventional iSLIP scheduler, whereby some of the differences betweenthe scheduler shown in FIG. 3 and an iSLIP scheduler are described indetail below. In the iSLIP scheduler algorithm, each connection betweena request and a grant block does not identify a specific switch unit(since there is only a single switch unit available), but rather onlyindicates whether or not a request is present. Also, in the iSLIPscheduler algorithm, each connection between a grant and an accept blockdoes not identify a specific switch unit (since there is only a singleswitch unit available), but rather only indicates whether or not a grantis present. Furthermore, the number of grants generated per grant blockper scheduler iteration is also different for the scheduler shown inFIG. 3 as compared to the iSLIP method, since iSLIP generates a singlegrant per scheduler iteration, while the scheduler according to FIG. 3generates up to one grant per parallel switch unit per scheduleriteration. This difference also exists for the connection between anaccept block and an acknowledge block.

As an alternative to the scheduler of the third embodiment shown in FIG.3, in a fourth embodiment, a scheduler performs the selection of theswitch unit in the grant block as part of the grant step, and not in therequest block as part of the request step. In the fourth embodiment, therotating priority switch unit request pointers defined per (input,output) port combination are maintained and updated by the grant blockand not by the request block. For the fourth embodiment, the switch unitavailability feeds into the grant block, rather than into the requestblocks as shown in FIG. 3.

FIG. 6 is a flowchart showing a scheduling method according to a fifthembodiment of the invention, which uses multiple iterations perscheduler allocation decision period. In general, the method accordingto the fifth embodiment is consistent with the method described inrelation to the first embodiment as shown in FIG. 2. However, the methodof FIG. 2 assumes that only a single iteration that corresponds to therequest, grant, and accept steps is performed during a schedulerallocation decision period, i.e., the timeslot period between thegeneration of scheduler allocation decisions. The method of FIG. 6tests, in step 500, to determine if the end of a timeslot has beenreached or is within a threshold range of termination. If yes, thecorresponding packets and/or cells are transmitted to their destinationoutput ports via their corresponding allocated switch units, in step510. If no, committed input and output links of the parallel switchunits are masked out in step 520, and a new iteration is performed. Inother words, if a request has been allocated an input-to-output switchpath, the request is not considered in the following iteration.

A sixth embodiment of the scheduling method according to the presentinvention extends the basic techniques of the invention to includerequests at multiple priority levels. In the sixth embodiment, eachinput unit maintains a separate input queue for each priority levelestablished per output port. This means that for an N×M switch with Ppriority levels (P being an integer value), each input unit maintainsP×M queues. The prioritized technique utilized in the sixth embodimentmay be defined as follows:

Step 1 (request step): Each output port request is extended to include apriority level. When an input generates a request for a particularswitch unit for a particular output port, the priority of the request isset equal to the highest priority non-empty input queue associated withthe particular output port.

Step 2 (grant step): When an output port receives request for aparticular switch unit, it determines the highest priority level of therequests, and the output port then grants one request among the receivedrequests with that determined priority level. The output port uses thesame rotating priority scheme as before per priority level per switchunit. When a grant is passed to the input port, the grant includes theselected priority level. As before, the increment step is only executedif the grant is correspondingly accepted in step 3 (step 230 in FIG. 2).

Step 3 (accept step): When an input port receives grants for aparticular switch unit, it determines the highest priority level of thegrants, and the input port then accepts one grant among the receivedgrants with that determined priority level. The input port uses the samerotating priority scheme as before per priority level per switch unit.This operation is performed for each of the parallel switch units perinput port as before.

A seventh embodiment of the present invention implements a number ofrotating priority grant mechanisms which is less than one rotatingpriority grant mechanism per switch unit per output port. In otherwords, the seventh embodiment uses less than K rotating priority grantmechanisms (K being the number of switch units) per output port, since asingle rotating priority grant mechanism can be used to cover two ormore switch units. Thus, one can implement anywhere from 2 to K rotatingpriority grant mechanisms per output port.

In the seventh embodiment, a rotating priority request selection for agiven output port selects between requests from input ports for a set ofparallel switch units, as opposed to selecting between requests for asingle switch unit only. The number of switch units in the set coveredby a rotating priority request selection can be in the range from two tothe number of parallel switch units, depending on the implementation.The maximum number of grants which can be generated per output perscheduling iteration is equal to the number of rotating priority requestselections performed per output port. The multiple rotating priorityrequest selections performed for an output port does not need to coveran identical number of parallel switch units. For each grant which isgenerated as a result of a rotating priority request selection, theswitch unit associated with the grant is set equal to the switch unit ofthe selected request.

An eighth embodiment of the invention implements a number of rotatingpriority accept mechanisms which is less than one rotating priorityaccept mechanism per switch unit per input port. In other words, theeighth embodiment uses less than K rotating priority accept mechanisms(K being the number of switch units) per input port, since a singlerotating priority accept mechanism can be used to cover two or moreswitch units. Thus, one can implement anywhere from 2 to K rotatingpriority accept mechanisms per input port.

In the eighth embodiment, a rotating priority grant selection for agiven input port selects between grants from output ports for a set ofparallel switch units, as opposed to selecting between grants for asingle switch unit only. The number of switch units in the set coveredby a rotating priority grant selection can be in the range from two tothe number of parallel switch units depending on the implementation. Themaximum number of accepts which can be generated per input perscheduling iteration is equal to the number of rotating priority grantselections performed per input port. The multiple rotating prioritygrant selections performed for an input port does not need to cover anidentical number of parallel switch units. For each accept which isgenerated as a result of a rotating priority grant selection, the switchunit associated with the accept is set equal to the switch unit of theselected grant.

A ninth embodiment of the invention implements a number (e.g., R, whereR is an integer value) of rotating priority grant mechanisms which isless than one rotating priority grant mechanism per switch unit peroutput port, and a number (e.g., S, where S is an integer value) ofrotating priority accept mechanisms which is less than one rotatingpriority grant mechanism per switch unit per input port. In the ninthembodiment S may be set equal to R, or they may have different values,depending upon the particular implementation.

A tenth embodiment of the invention is similar to the first embodimentin most respects, but whereby it utilizes a “random selection” priorityscheme instead of a rotating priority scheme. In the tenth embodiment,in step 1 (requesting step), each input port randomly selects uniformlyacross all parallel switch units which one of the parallel switch unitsto request for the output port. In step 2 (granting step), each outputport per switch unit randomly selects a request uniformly over allreceived requests. In step 3 (accepting step), each input port perswitch unit randomly selects a grant uniformly over all received grants.The “random selection” scheme may also be utilized with otherembodiments of the invention, as an alternative to the “rotatingpriority” scheme that was described with respect to those otherembodiments.

Thus, apparatuses and methods have been described according to thevarious embodiments of the present invention. Many modifications andvariations may be made to the techniques and structures described andillustrated herein without departing from the spirit and scope of theinvention. Accordingly, it should be understood that the methods andapparatus described herein are illustrative only and are not limitingupon the scope of the invention. The scheduling method and systemaccording to any of the embodiments of the present invention can beutilized in a network interconnect crosspoint architecture and method,such as the one described in U.S. patent application Ser. No.10/898,540, filed Jul. 26, 2004, which is incorporated in its entiretyherein by reference.

1. A method of switching data using a switch that includes a pluralityof input ports each having at least one input queue, a plurality ofswitch units, and a plurality of output ports, the method comprising: a)each input port having data to be sent to one or more output portsstored in an input queue generating a request to each of the one or moreoutput ports to which data in the input port is to be sent, wherein eachrequest identifies one of the plurality of switch units for use intransferring data from the requesting input port to the correspondingoutput port; b) generating grants per output port per switch unit, eachgrant corresponding to one of the requests generated in step a); c)accepting grants per input port per switch unit; and d) outputting datafrom the respective input ports to the respective output ports, based onthe accepted grants, utilizing the switch units identified in therequests corresponding to the accepted grants.
 2. The method accordingto claim 1, wherein each of the switch units has N input ports and Moutput ports, N and M being positive integers, and wherein each of theswitch units is capable of switching a packet or cell from any one ofthe N input ports to any one of the M output ports.
 3. The methodaccording to claim 2, wherein each of the switch units is a crossbarswitch.
 4. The method according to claim 1, wherein the switch units aredisposed in a parallel relationship with respect to each other.
 5. Themethod according to claim 1, wherein generating grants further comprisesgenerating multiple grants per output port up to a maximum of one grantper switch unit per output port.
 6. The method according to claim 1,wherein accepting grants further comprises accepting multiple grants perinput port up to a maximum of one grant per switch unit per input port.7. The method according to claim 1, further comprising: in step a),selecting a switch unit to be identified in each request based onpriority values assigned to the switch units; after the respectivegrants have been accepted in step c), assigning priority values to theswitch units such that switch units utilized in the accepted grants havea lower priority value with respect to the switch units that were notutilized in accepted grants; and repeating the method from step a).
 8. Aswitching system, comprising: a plurality of input ports each having atleast one input queue; a plurality of switch units that arecommunicatively connected to the plurality of input ports; a pluralityof output ports that are communicatively connected to the plurality ofswitch units; and a scheduler configured to: a) receive requestsgenerated by one or more of the input ports, each request being made tooutput data stored in an input queue of an input port to one of theoutput ports, wherein each request identifies one of the plurality ofswitch units for use in transferring data from the requesting input portto the corresponding output port; b) generate grants per output port perswitch unit, each grant corresponding to one of the requests received instep a); c) accept grants per input port per switch unit; and d)instruct the corresponding input ports to output the data from thecorresponding input queues of the corresponding input ports to thecorresponding output ports, based on the accepted grants, utilizing theswitch units identified in the requests corresponding to the acceptedgrants.
 9. The switching system according to claim 8, wherein each ofthe switch units has N input ports and M output ports, N and M beingpositive integers, and wherein each of the switch units is capable ofswitching a packet or cell from any one of the N input ports to any oneof the M output ports.
 10. The switching system according to claim 9,wherein each of the switch units is a crossbar switch.
 11. The switchingsystem according to claim 8, wherein the switch units are disposed in aparallel relationship with respect to each other.
 12. The switchingsystem according to claim 8, wherein the scheduler is further configuredto generate multiple grants per output port up to a maximum of one grantper switch unit per output port.
 13. The switching system according toclaim 8, wherein the scheduler is further configured to accept multiplegrants per input port up to a maximum of one grant per switch unit perinput port.